Incidence monoids: automorphisms and complexity
نویسندگان
چکیده
The algebraic monoid structure of an incidence algebra is investigated. We show that the multiplicative alone determines automorphisms algebra. present a formula expresses complexity with respect to two sided action its maximal torus in terms zeta polynomial poset. In addition, we characterize finite (connected) posets whose monoids have $$\le 1$$ . Finally, determine covering relations adherence order on star
منابع مشابه
Complexity Analysis: Finite Transformation Monoids
We examine the computational complexity of some problems from algebraic automata theory and from the field of communication complexity: testing Green’s relations (relations that are fundamental in monoid theory), checking the property of a finite monoid to have only Abelian subgroups, and determining the deterministic communication complexity of a regular language. By well-known algebraizations...
متن کاملDecidability and Complexity in Automatic Monoids
We prove several complexity and decidability results for automatic monoids: (i) there exists an automatic monoid with a P-complete word problem, (ii) there exists an automatic monoid such that the firstorder theory of the corresponding Cayley-graph is not elementary decidable, and (iii) there exists an automatic monoid such that reachability in the corresponding Cayley-graph is undecidable. Mor...
متن کاملAutomorphisms of Rings and Applications to Complexity
Rings are fundamental mathematical objects with two operations, addition and multiplication, suitably defined. A known way of studying the structure of rings is to consider automorphisms of rings. In my PhD thesis I consider finite dimensional rings represented in terms of their additive basis and study the computational complexity of various automorphism problems of rings in this representatio...
متن کاملMultiparty Communication Complexity of Finite Monoids
We study the relationship between the complexity of languages, in Yao's 2-party communication game and its extensions, and the algebraic properties of nite monoids that can recognize them. For a nite monoid M, we deene C (k) (M) to be the maximum number of bits of communication that players need to exchange, in the k-party game of Chandra, Furst and Lipton, to decide membership in any language ...
متن کاملParameterized Complexity of Small Weight Automorphisms
We consider the PermCode problem to decide, given a representation of a permutation group G and a parameter k, whether there is a non-trivial element of G with support at most k. This problem generalizes several problems in the literature. We introduce a new method that allows to reduce the maximal orbit size of the group being considered while maintaining elements with small support in the gro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2021
ISSN: ['0037-1912', '1432-2137']
DOI: https://doi.org/10.1007/s00233-021-10199-6